Exponential capacity of associative memories under quantum annealing recall
نویسندگان
چکیده
Siddhartha Santra,1, 2, ∗ Omar Shehab,3 and Radhakrishnan Balu1, † U.S. Army Research Laboratory, Computational and Information Sciences Directorate, ATTN: CIH-N, Aberdeen Proving Ground, Maryland, U.S.A. 21005-5069. Department of Aeronautics and Astronautics, Stanford University, 496 Lomita Mall, Stanford, California, U.S.A. 94305. Dept of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, 1000 Hilltop circle, Maryland, U.S.A. 21250.
منابع مشابه
Artificial Associative Memory Using Quantum Processes
This paper discusses an approach to constructing an artificial quantum associative memory (QuAM). The QuAM makes use of two quantum computational algorithms, one for pattern storage and the other for pattern recall. The result is an exponential increase in the capacity of the memory when compared to traditional associative memories such as the Hopfield network. Further, the paper argues for con...
متن کاملA Quantum Associative Memory Based on Grover’s Algorithm
Quantum computation uses microscopic quantum level effects to perform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts. The unique characteristics of quantum theory may also be used to create a quantum associative memory with a capacity exponential in the number of neurons. This paper combines two quantum computational al...
متن کاملHigh-Capacity Quantum Associative Memories
We review our models of quantum associative memories that represent the “quantization” of fully coupled neural networks like the Hopfield model. The idea is to replace the classical irreversible attractor dynamics driven by an Ising model with pattern-dependent weights by the reversible rotation of an input quantum state onto an output quantum state consisting of a linear superposition with pro...
متن کاملNoise Facilitation in Associative Memories of Exponential Capacity
Recent advances in associative memory design through structured pattern sets and graph-based inference algorithms have allowed reliable learning and recall of an exponential number of patterns that satisfy certain subspace constraints. Although these designs correct external errors in recall, they assume neurons that compute noiselessly, in contrast to the highly variable neurons in brain regio...
متن کاملProbabilistic quantum memories.
Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1602.08149 شماره
صفحات -
تاریخ انتشار 2016